On Designated Values in Multi-valued CTL* Model Checking

نویسندگان

  • Beata Konikowska
  • Wojciech Penczek
چکیده

A multi-valued version of CTL∗ (mv-CTL∗), where both the propositions and the accessibility relation are multi-valued, taking values in a complete lattice with a complement, is considered. Contrary to all the existing model checking results for multi-valued modal logics, our lattices are not required to be finite. A set of restrictions is provided under which there is a direct translation from mv-CTL∗ to CTL∗ model checking problem for designated values. Bisimulation induced by mvCTL∗ is characterized.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing Model Checking from Multi-valued Ctl to Ctl

A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-boolean algebra, is considered. A general translation from mv-CTL to CTL model checking is deened. An application of the translation is shown for the most commonly used quasi-boolean algebras.

متن کامل

An Introduction to Multi-Valued Model Checking

Nowadays computer systems have become ubiquitous. Most of the resources in the development of such systems, and especially in the fail-safe ones, are allocated into the simulation and verification of their behavior. One such automated method of verification is model checking. Given a mathematical description of the real system and a specification usually in the form of temporal logics, a model ...

متن کامل

Model Checking for Multi - Valued CTL

A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-Boolean algebra, is deened. A translation from mv-CTL model checking to CTL model checking is investigated. First, the case where the elements of quasi-Boolean algebras are totally ordered is considered. Secondly, it is shown how to design a translati...

متن کامل

Implementing a Multi-valued Symbolic Model Checker

Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. In this paper, we present an implementation of a symbolic model checker for multi-valued temporal logics. The model checker...

متن کامل

Model Checking with Multi-Valued Temporal Logics

Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. This paper presents a symbolic model checker for multi-valued temporal logics. The model checker works for any multivalued ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2004